Phase transitions in number theory: from the birthday problem to Sidon sets.

نویسندگان

  • Bartolo Luque
  • Iván G Torre
  • Lucas Lacasa
چکیده

In this work, we show how number theoretical problems can be fruitfully approached with the tools of statistical physics. We focus on g-Sidon sets, which describe sequences of integers whose pairwise sums are different, and propose a random decision problem which addresses the probability of a random set of k integers to be g-Sidon. First, we provide numerical evidence showing that there is a crossover between satisfiable and unsatisfiable phases which converts to an abrupt phase transition in a properly defined thermodynamic limit. Initially assuming independence, we then develop a mean-field theory for the g-Sidon decision problem. We further improve the mean-field theory, which is only qualitatively correct, by incorporating deviations from independence, yielding results in good quantitative agreement with the numerics for both finite systems and in the thermodynamic limit. Connections between the generalized birthday problem in probability theory, the number theory of Sidon sets and the properties of q-Potts models in condensed matter physics are briefly discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Partitioning Sidon Sets with Quasi-independent Sets

There is a construction of random subsets of Z in which almost every subset is Sidon (this was first done by Katznelson). More is true: almost every subset is the finite union of quasi-independent sets. Also, if every Sidon subset of Z\{0} is the finite union of quasi-independent sets, then the required number of quasi-independent sets is bounded by a function of the Sidon constant. Analogs of ...

متن کامل

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers

A set A of non-negative integers is called a Sidon set if all the sums a1+a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. A well-known problem on Sidon sets is the determination of the maximum possible size F (n) of a Sidon subset of [n] = {0, 1, . . . , n− 1}. Results of Chowla, Erdős, Singer and Turán from the 1940s give that F (n) = (1 + o(1)) √ n. We study Sidon subsets of sparse random sets...

متن کامل

The Number of Sidon Sets and the Maximum Size of Sidon

A set A of non-negative integers is called a Sidon set if all the sums a1+a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. A well-known problem on Sidon sets is the determination of the maximum possible size F (n) of a Sidon subset of [n] = {0, 1, . . . , n− 1}. Results of Chowla, Erdős, Singer and Turán from the 1940s give that F (n) = (1 + o(1)) √ n. We study Sidon subsets of sparse random sets...

متن کامل

Results on Sidon and B h Sequences

Results on Sidon and Bh Sequences Sangjune Lee A set A of non-negative integers is a Sidon set if all the sums a1 + a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. In this dissertation, we deal with results on the number of Sidon sets in [n] = {0, 1, · · · , n − 1} and the maximum size of Sidon sets in sparse random subsets of [n] or N (the set of natural numbers). We also consider a natural gen...

متن کامل

Constructions of generalized Sidon sets

We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = s1 + s2, si ∈ S; such sets are called Sidon sets if g = 2 and generalized Sidon sets (or B2[ ⌈ g/2 ⌉ ] sets) if g ≥ 3. We extend to generalized Sidon sets the Sidon-set constructions of Singer, Bose, and Ruzsa. We also further optimize Koulantzakis’ idea of interleaving sever...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 88 5  شماره 

صفحات  -

تاریخ انتشار 2013